Perfect sequence covering arrays

Sequence Covering Arrays

Sequential processes can encounter faults as a result of improper ordering of subsets of the events. In order to reveal faults caused by the relative ordering of t or fewer of v events, for some fixed t, a test suite must provide tests so that every ordering of every set of t or fewer events is exercised. Such a test suite is equivalent to a sequence covering array, a set of permutations on v e...

Sequence Covering Arrays and Linear Extensions

Covering subsequences by sets of permutations arises in numerous applications. Given a set of permutations that cover a specific set of subsequences, it is of interest not just to know how few permutations can be used, but also to find a set of size equal to or close to the minimum. These permutation construction problems have proved to be computationally challenging; few explicit constructions...

Perfect hash families, identifiable parent property codes and covering arrays

Profiles of covering arrays of strength two

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...

Covering arrays from cyclotomy

For a prime power q ≡ 1 (mod v), the q × q cyclotomic matrix, whose entries are the discrete logarithmsmodulo v of the entries in the addition table of Fq , has been shown using character theoretic arguments to produce an ε-biased array, provided that q is large enough as a function of v and ε. A suitable choice of ε ensures that the array is a covering array of strength t when q > t2v4t . On t...